Approximating Nearest Neighbor Distances

Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the Euclidean cluster diameter is large. Therefore, it is preferred to assign smaller costs to the paths that stay close to the input points. In this paper, we consider the most natural metric with this property, which we call the nearest neighbor metric. Given a point set P and a path $\gamma$, our metric charges each point of $\gamma$ with its distance to P. The total charge along $\gamma$ determines its nearest neighbor length, which is formally defined as the integral of the distance to the input points along the curve. We describe a $(3+\varepsilon)$-approximation algorithm and a $(1+\varepsilon)$-approximation algorithm to compute the nearest neighbor metric. Both approximation algorithms work in near-linear time. The former uses shortest paths on a sparse graph using only the input points. The latter uses a sparse sample of the ambient space, to find good approximate geodesic paths.Comment: corrected author nam

Assessment of surface roughness and blood rheology on local coronary hemodynamics: a multi-scale computational fluid dynamics study

The surface roughness of the coronary artery is associated with the onset of atherosclerosis. The study applies, for the first time, the micro-scale variation of the artery surface to a 3D coronary model, investigating the impact on haemodynamic parameters which are indicators for atherosclerosis. The surface roughness of porcine coronary arteries have been detailed based on optical microscopy and implemented into a cylindrical section of coronary artery. Several approaches to rheology are compared to determine the benefits/limitations of both single and multiphase models for multi-scale geometry. Haemodynamic parameters averaged over the rough/smooth sections are similar; however, the rough surface experiences a much wider range, with maximum wall shear stress greater than 6 Pa compared to the approximately 3 Pa on the smooth segment. This suggests the smooth-walled assumption may neglect important near-wall haemodynamics. While rheological models lack sufficient definition to truly encompass the micro-scale effects occurring over the rough surface, single-phase models (Newtonian and non-Newtonian) provide numerically stable and comparable results to other coronary simulations. Multiphase models allow for phase interactions between plasma and red blood cells which is more suited to such multi-scale models. These models require additional physical laws to govern advection/aggregation of particulates in the near-wall region

First Neutrino Observations from the Sudbury Neutrino Observatory

The first neutrino observations from the Sudbury Neutrino Observatory are presented from preliminary analyses. Based on energy, direction and location, the data in the region of interest appear to be dominated by 8B solar neutrinos, detected by the charged current reaction on deuterium and elastic scattering from electrons, with very little background. Measurements of radioactive backgrounds indicate that the measurement of all active neutrino types via the neutral current reaction on deuterium will be possible with small systematic uncertainties. Quantitative results for the fluxes observed with these reactions will be provided when further calibrations have been completed.Comment: Latex, 7 pages, 10 figures, Invited paper at Neutrino 2000 Conference, Sudbury, Canada, June 16-21, 2000 to be published in the Proceeding

Robust Poisson Surface Reconstruction

Abstract. We propose a method to reconstruct surfaces from oriented point clouds with non-uniform sampling and noise by formulating the problem as a convex minimization that reconstructs the indicator func-tion of the surface’s interior. Compared to previous models, our recon-struction is robust to noise and outliers because it substitutes the least-squares fidelity term by a robust Huber penalty; this allows to recover sharp corners and avoids the shrinking bias of least squares. We choose an implicit parametrization to reconstruct surfaces of unknown topology and close large gaps in the point cloud. For an efficient representation, we approximate the implicit function by a hierarchy of locally supported basis elements adapted to the geometry of the surface. Unlike ad-hoc bases over an octree, our hierarchical B-splines from isogeometric analysis locally adapt the mesh and degree of the splines during reconstruction. The hi-erarchical structure of the basis speeds-up the minimization and efficiently represents clustered data. We also advocate for convex optimization, in-stead isogeometric finite-element techniques, to efficiently solve the min-imization and allow for non-differentiable functionals. Experiments show state-of-the-art performance within a more flexible framework.

Interpolating and aproximating implicit surfaces from polygon soup

This paper describes a method for building interpolating or approximating implicit surfaces from polygonal data. The user can choose to generate a surface that exactly interpolates the polygons, or a surface that approximates the input by smoothing away features smaller than some user-specified size. The implicit functions are represented using a moving least-squares formulation with constraints integrated over the polygons. The paper also presents an improved method for enforcing normal constraints and an iterative procedure for ensuring that the implicit surface tightly encloses the input vertices

Spectral surface reconstruction from noisy point clouds

We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each tetrahedron is inside or outside the original object. The reconstructed surface triangulation is the set of triangular faces where inside and outside tetrahedra meet. Because the spectral partitioner makes local decisions based on a global view of the model, it can ignore outliers, patch holes and undersampled regions, and surmount ambiguity due to measurement errors. Our algorithm can optionally produce a manifold surface. We present empirical evidence that our implementation is substantially more robust than several closely related surface reconstruction programs. © The Eurographics Association 2004